منابع مشابه
Optimal lower bounds for locality sensitive hashing
We study lower bounds for Locality Sensitive Hashing (LSH) in the strongest setting: point sets in {0, 1} under the Hamming distance. Recall that H is said to be an (r, cr, p, q)-sensitive hash family if all pairs x, y ∈ {0, 1} with dist(x, y) ≤ r have probability at least p of collision under a randomly chosen h ∈ H, whereas all pairs x, y ∈ {0, 1} with dist(x, y) ≥ cr have probability at most...
متن کاملTetris-Hashing or optimal table compression
In this paper, we present a new method for mapping a static set of n keys, each an integer between 0 and N ? 1, into a hash table of size n without any collision. Our data structure requires only an additional array of n integers, each less than n, and achieves a worst case lookup time of O(1). This method is based on a randomized compression scheme, and it nds a minimal perfect hash function i...
متن کاملNear-Optimal Space Perfect Hashing Algorithms
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values. Since no collisions occur, each key can be retrieved from a hash table with a single probe. A minimal perfect hash function (MPHF) is a PHF with the smallest possible range, that is, the hash table size is exactly the number of keys in S. Differently from other hashing schemes, MPHFs completely ...
متن کاملPractical perfect hashing in nearly optimal space
A hash function is a mapping from a key universe U to a range of integers, i.e., h : U/f0;1, . . . ,m 1g, where m is the range’s size. A perfect hash function for some set SDU is a hash function that is one-to-one on S, where mZ9S9. A minimal perfect hash function for some set SDU is a perfect hash function with a range of minimum size, combines theoretical analysis, practical performance, expe...
متن کاملOptimal Bayesian Hashing for Efficient Face Recognition
In practical applications, it is often observed that high-dimensional features can yield good performance, while being more costly in both computation and storage. In this paper, we propose a novel method called Bayesian Hashing to learn an optimal Hamming embedding of high-dimensional features, with a focus on the challenging application of face recognition. In particular, a boosted random FER...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1984
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(84)80010-8